In order to meet the requirements of high reliability and low latency in the 5G network environment, and reduce the resource consumption of network bandwidth at the same time, a Service Function Chain (SFC) deployment method based on node comprehensive importance ranking for traffic and reliability optimization was proposed. Firstly, Virtualized Network Function (VNF) was aggregated based on the rate of traffic change, which reduced the deployed physical nodes and improved link reliability. Secondly, node comprehensive importance was defined by the degree, reliability, comprehensive delay and link hop account of the node in order to sort the physical nodes. Then, the VNFs were mapped to the underlying physical nodes in turn. At the same time, by restricting the number of links, the “ping-pong effect” was reduced and the traffic was optimized. Finally, the virtual link was mapped through k-shortest path algorithm to complete the deployment of the entire SFC. Compared with the original aggregation method, the proposed method has the SFC reliability improved by 2%, the end-to-end delay of SFC reduced by 22%, the bandwidth overhead reduced by 29%, and the average long-term revenue-to-cost ratio increased by 16%. Experimental results show that the proposed method can effectively improve the link reliability, reduce end-to-end delay and bandwidth resource consumption, and play a good optimization effect.
Aiming at the problem that the pre-training model BERT (Bidirectional Encoder Representation from Transformers) lacks of vocabulary information, a Chinese named entity recognition model called OpenKG + Entity Enhanced BERT + CRF (Conditional Random Field) based on knowledge base entity enhanced BERT model was proposed on the basis of the semi-supervised entity enhanced minimum mean-square error pre-training model. Firstly, documents were downloaded from Chinese general encyclopedia knowledge base CN-DBPedia and entities were extracted by Jieba Chinese text segmentation to expand entity dictionary. Then, the entities in the dictionary were embedded into BERT for pre-training. And the word vectors obtained from the training were input into Bidirectional Long-Short-Term Memory network (BiLSTM) for feature extraction. Finally, the results were corrected by CRF and output. Model validation was performed on datasets CLUENER 2020 and MSRA, and the proposed model was compared with Entity Enhanced BERT pre-training, BERT+BiLSTM, ERNIE and BiLSTM+CRF models. Experimental results show that compared with these four models, the proposed model has the F1 score increased by 1.63 percentage points and 1.1 percentage points, 3.93 percentage points and 5.35 percentage points, 2.42 percentage points and 4.63 percentage points, 6.79 and 7.55 percentage points, respectively in the two datasets. It can be seen that the comprehensive effect of the proposed model on named entity recognition is effectively improved, and the F1 scores of the model are better than those of the comparison models.
In this paper, the military Petrol-Oil and Lubricants (POL) allotment and transportation problem was studied by introducing the concept of support time window. Considering the complicated restrictions of POL support time and transportation capability, the POL allotment and transportation model based on multiple time windows was proposed by using Constraint Satisfaction Problem (CSP) modelling approach. Firstly, the formalized description of the problem elements was presented, such as POL support station, demand unit, support time window, support demand, and support task. Based on the formalized description, the CSP model for POL support was constructed. The multi-objective model was transformed into single-objective one by using perfect point method. Finally, the solving procedure and its steps were designed based on Particle Swarm Optimization (PSO) algorithm, and an arithmetic example was followed to demonstrate the application of the method. In the example, the two optimization schemes obtained by the model given in this paper and got by the model in which the objective is maximizing the quantity supported were compared. In the two schemes, the transportation capacity both reached a maximum utilization, but the start supporting time of each POL demand in the scheme of the proposed method was no later than the one in the scheme of the single-objective model. By comparing different optimization schemes, it is shown that the proposed model and algorithm can effectively solve the multi-objective POL support optimization problem.